Construction of uninorms on bounded lattices
نویسندگان
چکیده
منابع مشابه
On Equations in Bounded Lattices
The following properties of Boolean equations are well known: every system of equations is equivalent to a single equation of the form f(x1, . . . , xn) = 1, the consistency condition for such an equation, the method of successive elimination of variables, and the formula for the general (reproductive) solution using a particular solution. These features are shared by Post equations and by equa...
متن کاملa study on construction of iranian life tables: the case study of modified brass logit system
چکیده ندارد.
15 صفحه اولOn Bounded Distance Decoding for General Lattices
A central problem in the algorithmic study of lattices is the closest vector problem: given a lattice L represented by some basis, and a target point y, nd the lattice point closest to y. Bounded Distance Decoding is a variant of this problem in which the target is guaranteed to be close to the lattice, relative to the minimum distance 1(L) of the lattice. Speci cally, in the -Bounded Distance ...
متن کاملDuality for Bounded Lattices
We present a duality theorem for bounded lattices that improves and strengthens Urquhart's topological representation for lattices. Rather than using maximal, disjoint lter-ideal pairs, as Urquhart does, we use all disjoint lter-ideal pairs. This allows not only for establishing a bijective correspondance between lattices and a certain kind of doubly ordered Stone Spaces (Urquhart), but for a f...
متن کاملCoproducts of Bounded Distributive Lattices
Let LM denote the coproduct of the bounded distributive lattices L and M. At the 1981 Bann Conference on Ordered Sets, the following question was posed: What is the largest class L of nite distributive lattices such that, for every non-trivial Boolean lattice B and every L 2 L, B L = B L 0 implies L = L 0 ? In this note, the problem is solved.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Kybernetika
سال: 2017
ISSN: 0023-5954,1805-949X
DOI: 10.14736/kyb-2017-3-0394